Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(id, x) → x
app(plus, 0) → id
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

Q is empty.


QTRS
  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app(id, x) → x
app(plus, 0) → id
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

Q is empty.

We use [23] with the following order to prove termination.

Lexicographic path order with status [19].
Quasi-Precedence:
[app2, id, 0, s] > plus

Status:
app2: [1,2]
id: multiset
plus: multiset
0: multiset
s: multiset